Universal multiresolution source codes
نویسندگان
چکیده
منابع مشابه
Universal multiresolution source codes
A multiresolution source code is a single code giving an embedded source description that can be read at a variety of rates and thereby yields reproductions at a variety of resolutions. The resolution of a source reproduction here refers to the accuracy with which it approximates the original source. Thus, a reproduction with low distortion is a “high-resolution” reproduction while a reproducti...
متن کاملIterative Joint Design of Source Codes and Multiresolution Channel Codes
We propose an iterative design algorithm for jointly optimizing source and channel codes. The joint design combines channel-optimized vector quantization (COVQ) for the source code with rate-compatible punctured convolutional (RCPC) coding for the channel code. Our objective is to minimize the average end-to-end distortion. For a given channel SNR and transmission rate, our joint source and cha...
متن کاملEfficient universal noiseless source codes
Although the existence of universal noiseless variable-rate codes for the class of discrete stationary ergodic sources has previously been established, very few practical universal encoding methods are available. Efficient implementable universal source coding techniques are discussed in this paper. Results are presented on source codes for which a small value of the maximum redundancy is achie...
متن کاملUniversal Linked Multiple Access Source Codes
We consider the multiple access source coding (MASC) problem (also known as the SlepianWolf problem) for situations where the joint source statistics are unknown a priori. Since neither encoder receives information about the joint source statistics, we allow an asymptotically negligible amount of communication between the encoders. We prove the existence of universal 2-encoder Linked MASCs (LMA...
متن کاملUniversal variable-to-fixed length source codes
A universal variable-to-fixed length algorithm for binary memoryless sources which converges to the entropy of the source at the optimal rate is known. We study the problem of universal variable-to-fixed length coding for the class of Markov sources with finite alphabets. We give an upper bound on the performance of the code for large dictionary sizes and show that the code is optimal in the se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2001
ISSN: 0018-9448
DOI: 10.1109/18.945238